Split delivery vehicle routing problem with time windows: a case study
نویسندگان
چکیده
منابع مشابه
Competitive Vehicle Routing Problem with Time Windows and Stochastic Demands
The competitive vehicle routing problem is one of the important issues in transportation area. In this paper a new method for competitive VRP with time windows and stochastic demand is introduced. In the presented method a three time bounds are given and the probability of arrival time between each time bound is assumed to be uniform. The demands of each customer are different in each time wind...
متن کاملVehicle routing problem with time-windows for perishable food delivery
This study has extended a vehicle routing problem, with time-windows (VRPTW), by considering the randomness of the perishable food delivery process, and constructing a SVRPTWmodel, to obtain optimal delivery routes, loads, fleet dispatching and departure times for delivering perishable food from a distribution center. Our objective was to minimize not only the fixed costs for dispatching vehicl...
متن کاملBranch-and-Cut for the Split Delivery Vehicle Routing Problem with Time Windows
The Split Delivery Vehicle Routing Problem with Time Windows (SDVRPTW) is a notoriously hard combinatorial optimization problem. First, it is hard to find a useful compact Mixed-Integer Programming (MIP) formulation for the SDVRPTW. Standard modeling approach either suffer from inherent symmetries (MIPs with a vehicle index) or cannot exactly capture all aspects of feasibility. Due to the possi...
متن کاملA goal programming model for vehicle routing problem with backhauls and soft time windows
The vehicle routing problem with backhauls (VRPB) as an extension of the classical vehicle routing prob-lem (VRP) attempts to define a set of routes which services both linehaul customers whom product are to be delivered and backhaul customers whom goods need to be collected. A primary objective for the problem usually is minimizing the total distribution cost. Most real-life problems have othe...
متن کاملThe Vehicle Routing Problem with Discrete Split Delivery and Time Windows
The Discrete Split Delivery Vehicle Routing Problem with Time Windows (DSDVRPTW) consists of designing the optimal set of routes to serve, at least cost, a given set of customers while respecting constraints on vehicles’ capacity and customer time windows. The delivery request of a customer consists of several discrete items which cannot be split further. The problem belongs to the class of spl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IOP Conference Series: Materials Science and Engineering
سال: 2018
ISSN: 1757-8981,1757-899X
DOI: 10.1088/1757-899x/337/1/012012